Managing infectious forwarded messages

ABSTRACT

Systems and methods for managing forwarded infectious messages are provided. Managing electronic message comprises receiving a message, forwarding the message, determining that the forwarded message is infectious after the message has been forwarded and preventing the infectious forwarded message from spreading.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 11/895,519 filed Aug. 24, 2007 and titled “Managing Infectious Forwarded Messages,” which is a division of and claims priority to U.S. patent application Ser. No. 11/156,373 filed Jun. 16, 2005 and titled “Managing Infectious Messages,” now U.S. Pat. No. 7,343,624, which claims priority to U.S. provisional patent application No. 60/587,839 filed Jul. 13, 2004 and titled “Detecting Malicious Message on Day Zero,” the disclosures of which are incorporated herein by reference.

BACKGROUND OF THE INVENTION

Computer viruses and worms are often transmitted via electronic messages. An infectious message usually comes in the form of an e-mail with a file attachment, although other forms of infection are possible. Attackers have exploited many protocols that exchange electronic information, including email, instant messaging, SQL protocols, Hyper Text Transfer Protocols (HTTP), Lightweight Directory Access Protocol (LDAP), File Transfer Protocol (FTP), telnet, etc. When the attachment is opened, the virus executes. Sometimes the virus is launched through a link provided in the email. Virus or worm attacks can cause considerable damage to organizations. Thus, many anti-virus solutions have been developed to identify viruses and prevent further damage. Currently, most anti-virus products use virus signatures based on known viruses for identification. Such systems, however, often do not protect the network effectively during the time window between a virus' first appearance and the deployment of its signature. Networks are particularly vulnerable during this time window, which is referred to as “time zero” or “day zero”. For a typical anti-virus system to function effectively, it usually requires viruses to be identified, their signatures developed and deployed. Even after the system adapts after an outbreak, time zero threat can sometimes re-immerge as the virus mutates, rendering the old signature obsolete.

One approach to time zero virus detection is to use a content filter to identify and quarantine any message with a potentially executable attachment. This approach is cumbersome because it could incorrectly flag attachments in Word, Excel and other frequently used document formats even if the attachments are harmless, resulting in high rate if misidentification (also referred to as false positives). Furthermore, the approach may not be affective if the virus author disguises the nature of the attachment. For example, some virus messages ask the recipients to rename a .txt file as .exe and then click on it. Sometimes the virus author exploits files that were not previously thought to be executable, such as JPEG files. Therefore, it would be useful to have a better time zero detection technique. It would also be desirable if the technique could detect viruses more accurately and generate fewer false positives.

SUMMARY OF THE CLAIMED INVENTION

Systems and methods of the present invention provide for managing infectious forwarded messages.

In a first claimed embodiment, a method of managing messages includes a step of receiving a first message over a network at a network interface. The first message includes an attachment file having a file name and an embedded bit pattern. The method includes executing instructions stored in memory that, when executed, determine that the attachment file is executable based on the embedded bit pattern and determine that the attachment file is a text file based on the file name. The executed instructions further store a copy of the first message in memory based on the disparity between the determination that the attachment file is executable and the determination that the attachment file is a text file. The method includes transmitting the first message over the network to a mail server and receiving a second message over the network at the network interface. The method further includes comparing the second message to the copy of the transmitted first message stored in memory, deleting the second message from a local send queue, and sending a cancellation request concerning the transmitted first message to the mail server. The deletion and cancellation request steps occur automatically when the second message matches the copy of the transmitted first message in memory.

In a second claimed embodiment, an electronic message management system includes a network interface, a memory that stores instructions, and a processor communicatively coupled to the memory and the network interface. The network interface receives a first message over a network. The first message includes an attachment file having a file name and an embedded bit pattern. The network interface transmits the first message over the network to a mail server and receives a second message over the network at the network interface after transmitting the first message to the mail server. When the instructions stored in memory are executed by the processor, the processor determines that the attachment file of the first message is executable based on the embedded bit pattern and determines that the attachment file of the first message is a text file based on the file name. The processor stores a copy of the first message in memory based on the disparity between the determination that the attachment file is executable and the determination that the attachment file is a text file. The processor further compares the second message received after transmission of the first message to the copy of the transmitted first message stored in memory. The processor then automatically deletes the second message from a local send queue and automatically sends a cancellation request concerning the transmitted first message to the mail server when the second message matches the copy of the transmitted first message in memory.

In a third claimed embodiment, a non-transitory computer readable storage medium includes a computer program that is executable by a processor to perform a method of managing messages. The method of managing messages includes a step of analyzing a first message received over a network at a network interface. The first message includes an attachment file having a file name and an embedded bit pattern. Analyzing the first message includes determining that the attachment file is executable based on the embedded bit pattern and determining that the attachment file is a text file based on the file name. The method further includes storing a copy of the first message in memory based on the disparity between the determination that the attachment file is executable and the determination that the attachment file is a text file. The method includes transmitting the first message over the network to a mail server and then comparing a second message received over the network at the network interface to the copy of the transmitted first message stored in memory. The method further includes a step of automatically deleting the second message from a local send queue and automatically sending a cancellation request concerning the transmitted first message to the mail server when the second message matches the copy of the transmitted first message in memory.

BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments of the invention are disclosed in the following detailed description and the accompanying drawings.

FIG. 1 is a system diagram illustrating an embodiment of a message delivery system.

FIG. 2 is a flowchart illustrating a process embodiment for detecting infectious message.

FIG. 3 is a flowchart illustrating the implementation of the individual message analysis according to some embodiments.

FIG. 4 is a flowchart illustrating an embodiment of traffic analysis.

FIG. 5 is a flowchart illustrating another embodiment of traffic analysis.

DETAILED DESCRIPTION

The invention can be implemented in numerous ways, including as a process, an apparatus, a system, a composition of matter, a computer readable medium such as a computer readable storage medium or a computer network wherein program instructions are sent over optical or electronic communication links. In this specification, these implementations, or any other form that the invention may take, may be referred to as techniques. A component such as a processor or memory described as being configured to perform a task includes both a general component that is temporarily configured to perform the task at a given time or a specific component that is manufactured to perform the task. In general, the order of the steps of disclosed processes may be altered within the scope of the invention.

A detailed description of one or more embodiments of the invention is provided below along with accompanying figures that illustrate the principles of the invention. The invention is described in connection with such embodiments, but the invention is not limited to any embodiment. The scope of the invention is limited only by the claims and the invention encompasses numerous alternatives, modifications and equivalents. Numerous specific details are set forth in the following description in order to provide a thorough understanding of the invention. These details are provided for the purpose of example and the invention may be practiced according to the claims without some or all of these specific details. For the purpose of clarity, technical material that is known in the technical fields related to the invention has not been described in detail so that the invention is not unnecessarily obscured.

Detecting infectious messages is disclosed. Analysis of individual characteristics of messages is performed in some embodiments to determine whether the message is suspicious. If a message is deemed suspicious, it is determined whether a similar message has been noted previously as possibly suspicious. If a similar message has been previously noted, the message is classified according to its individual characteristics and its similarity to the noted message. In some embodiments, if a message that was forwarded is later found to be infectious, the infectious message is reported to human or machine agents for appropriate action to take place.

FIG. 1 is a system diagram illustrating an embodiment of a message delivery system. In this example, message forwarding device 102 may be implemented as a mail server or gateway or other appropriate device. The message forwarding device is configured to forward messages received on its input interface. As used herein, forwarding includes sending a message to email servers or gateways, networking devices, email clients of individual recipients, or any other appropriate locations in the message's path of flow. Some of the messages to be forwarded may be infectious (i.e. containing viruses, worms or other items that may cause unwanted behavior on the recipient's device and/or the network). In this example, an infectious message detection mechanism 104 cooperates with the message forwarding device to identify the virus and prevents infectious messages from further spreading. In some embodiments, the virus detection mechanism is implemented as software, firmware, specialized hardware or any other appropriate techniques on the message forwarding device. In some embodiments, the detection mechanism is implemented on a separate device.

FIG. 2 is a flowchart illustrating a process embodiment for detecting infectious messages. Process 200 may be implemented on a message forwarding device, a standalone device, or as a part of another network monitoring/security device for any other appropriate device systems. In this example, an individual message analysis is performed initially (202). As will be shown in more details below, the individual message analysis evaluates the intrinsic characteristics of the message, determines the probability of the message being infectious, and classifies the message. In some embodiments, the message is classified as legitimate, suspicious or infectious based on the probability. The message is determined to be legitimate if the probability is below a legitimate threshold, infectious if the probability exceeds an infectious threshold, and suspicious if the probability is somewhere between the two thresholds. Other evaluations and classification techniques are used in different embodiments.

In the process shown, if a message is determined to be legitimate, the message is forwarded to the appropriate recipient (204). If the message is determined to be infectious, the message is treated as appropriate (206). In some embodiments, the message is quarantined or deleted from the delivery queue. If a message is deemed to be suspicious, a traffic analysis is performed on the suspicious message (208). The traffic analysis identifies any traffic spike in the e-mail message stream that is consistent with the pattern of a virus outbreak. Details of the traffic analysis are described below. In this example, analysis of a message in the context of all message traffic yields another probability of the message being infectious, and classifies the suspicious message as either legitimate or infectious according to the probability. Legitimate messages are processed normally and forwarded to their destinations (204). Infectious messages are treated appropriately (206). Other classifications are also possible. The order of the analyses may be different in some implementations and some embodiments perform the analysis in parallel. In some embodiments, each analysis is performed independently.

FIG. 3 is a flowchart illustrating the implementation of the individual message analysis according to some embodiments. In this example, process 202 initiates when a message is received (302). The message is then submitted to a plurality of tests configured to examine the characteristics of the message and detect any anomalies. After each test, the probability of the message being infectious is updated according to the test result (318). In some embodiments, the weight of different test results in calculating the probability may vary.

It is then determined whether the probability exceeds the threshold for the message to be deemed infectious (320). If so, the message is considered infectious and may be quarantined, deleted from send queue, or otherwise appropriately handled. If, however, the probability does not exceed the threshold, it is determined whether more tests are available (322). If so, the next available test is applied and the process of updating probability and testing for threshold is repeated. If no more tests are available, the probability is compared to the threshold required for a legitimate message (324). If the probability exceeds the legitimate threshold, the message is deemed to be suspicious. Otherwise, the tests indicate that the message is legitimate. The classification of the message is passed on to the next routine. According to process 200, depending on whether the message is legitimate, suspicious or infectious, the next routine may forward the message, perform traffic analysis on the message, or treat the message as infectious.

Examples of the tests used in the individual message analysis include signature matching tests (304), file name tests (306), character tests (308), bit pattern tests (310), N-gram tests (312), bit pattern test (314), and probabilistic finite state automata (PFSA) tests (316). The tests may be arranged in ay appropriate order. Some tests maybe omitted and different tests may be used.

Some of the tests analyze the intrinsic characteristics of the message and/or its attachments. In the embodiments shown, the signature matching test (304) compares the signature of the message with the signatures of known viruses. The test in some embodiments generates a probability on a sliding scale, where an exact match leads to a probability of 1, and an inexact match receives a probability value that depends on the degree of similarity.

The file name test (306) examines the name of the attachment and determines if there is anomaly. For example, a file name such as “read me.txt.exe” is highly suspicious since it would appear that the sender is attempting to misrepresent the nature of the executable and pass the file off as a text file.

FIG. 1 illustrates a system 100 for a transaction process between a user 101 and a vendor 104. The system 100 includes user experience system 102, vendor strategy system 103, and interaction system 107. Each of systems 102, 103, and 107 may communicate directly with each other, for example wired channels 105 and 106, or indirectly over network 120. Network 120 may include one or more private networks, public networks, LANs, WANs, the Internet, an intranet, a Wi-Fi network, cellular network, or a combination of these networks.

The bit pattern test (310) examines certain portions of the file and determines whether there is anomaly. Many files contain embedded bit patterns that indicate the file type. The magic number or magic sequence is such a bit pattern. For example, an executable file includes a particular bit pattern that indicates to the operating system that the file is an executable. The operating system will execute any file that starts with the magic sequence, regardless of the file extension. If an attachment has an extension such as .txt or .doc that seems to indicate that the file is textual in nature, yet the starting sequence in the file contains the magic sequence of an executable, then there is a high probability that the sender is attempting to disguise an executable as a text document. Therefore, the attachment is highly suspicious.

Some of the tests such as N-gram (312) and PFSA (314) measure the deviation of the received message from a baseline. In this example, the baseline is built from a collection of known good messages. An N-gram model describes the properties of the good messages. The N-gram model is a collection of token sequences and the corresponding probability of each sequence. The tokens can be characters, words or other appropriate entities. The test compares the N-gram model to an incoming message to estimate the probability that a message is legitimate. The probabilities of the N-gram sequences of the incoming messages can be combined with the probabilities of the N-gram sequences of the baseline model using any of several methods. In some embodiments, the N-gram test compares the test result with a certain threshold to determine the legitimacy of a message. In some embodiments, a message deemed legitimate by the N-gram test is not subject to further testing, thus reducing false positive rate. In some embodiments, a message found to be legitimate by the N-gram test is further tested to ascertain its true legitimacy.

In the example shown, the PFSA test (314) relies on a model that is built from a set of known good messages. The model describes the properties of legitimate messages. The model includes a plurality of token such as characters and words, and the probabilities associated with the tokens. The test estimates the probability that a particular message that includes a sequence of tokens can be generated by the model. In some embodiments, similar to the N-gram test, the test result is compared with a certain threshold to determine the legitimacy of a message. In some embodiments, a message deemed legitimate by the PFSA test is not subject to further testing to avoid false positives. In some embodiments, a message found to be legitimate by the PFSA test is further tested to ascertain its true legitimacy.

In some embodiments, information about previously received messages is collected and used to identify an increase in the number of similar and potentially suspicious messages. Messages are clustered to establish a statistical model that can be used to detect similar messages. The data collected may include one or more of the following: time of receipt, the recipients, number of recipients, the sender, size of the attachment, number of attachments, number of executable attachments, file name, file extension, file type according to the starting sequence of the file binary, etc. The characteristics of an incoming message are compared to the model to determine whether similar messages have been noted previously. A traffic spike in similar messages that were previously noted as potentially suspicious indicates the likelihood of a virus outbreak.

In some embodiments, traffic patterns are analyzed on a global network level. In other words, the analysis may monitor all the messages routed through an internet service provider and note the suspicious ones. In some embodiments, the traffic patterns are analyzed locally. For example, messages on a local network or on different subnets of a local network may be analyzed separately. In some embodiments, a combination of global and local analyses is used.

In local traffic analysis, different subnets can have different traffic patterns. For example, within a corporation, the traffic on the engineering department subnet may involve a large number of executables and binary files. Thus, absent other indicators, executables and binary attachments will not always trigger an alarm. In contrast, the traffic pattern of the accounting department may mostly involve text documents and spreadsheets, therefore an increase in binary or executable attachments would indicate a potential outbreak. Tailoring traffic analysis based on local traffic can identify targeted attacks as well as variants of old viruses.

FIG. 4 is a flowchart illustrating an embodiment of traffic analysis. Process 208 may be performed after the individual message analysis as shown in process 200, before the individual message analysis, in combination with other analysis, or independently. Process 208 initiates when a message is received (402). The characteristics of the message are compared to the characteristics of previously stored suspicious message (404). In some embodiments, the system collects suspicious messages resulting from other tests such as the ones in the individual message analysis shown in FIG. 3.

It is then determined whether the message is similar to the previous stored messages (406). If the message is not similar to any of the previously stored suspicious messages, a low probability of infectiousness is assigned. If, however, the message is similar to previous stored suspicious messages, information associated with the received message is also stored and statistical model is updated accordingly (408). It is then determined whether the number of such similar and suspicious messages has exceeded a predefined threshold (410). If not, the message is not classified as infectious at this point, although a higher probability may be assigned to it. If the total number of such suspicious messages has exceeded the threshold, it is likely that the message is indeed infectious and should be appropriately treated. For example, consider the case where the threshold number is set to 5, and there are already 4 instances of suspicious messages with executable attachments having the same extension and similar size. When a fifth message arrives with similar sized executable attachments with the same extension, the message will be classified as infectious. By selecting an appropriate threshold value, infectious messages can be detected and prevented without a major outbreak.

Sometimes the system may initially find a message to be legitimate or merely suspicious and forward the message to its destination. Later as more information becomes available, the system may find the message to be infectious. FIG. 5 is a flowchart illustrating another embodiment of traffic analysis. Process 500 may be performed independently or in conjunction with other types of message analyses. In the example shown, a message is received (502). The message is initially determined to be legitimate and forwarded (504). Sometime after he message has been forwarded, the forwarded message is determined to be infectious (506). A message may be found as infectious according to any appropriate message analysis techniques, including those described in this specification. In some embodiments, information pertaining to the forwarded message is optionally stored in memory, on disk or in other forms of storage medium so that it can be used for the analysis. Again, consider the example where the threshold number in the traffic analysis is set to 5 and 4 similar messages have been received. Although these 4 messages are noted as suspicious, because the threshold is not met the messages are still forwarded. The characteristics of the suspicious messages are stored. When a similar fifth message is received, its characteristics are compared to the characteristics of the four previously noted messages. N-gram, PFSA or other appropriate techniques can be used in the comparison. The analysis shows that the number of similar and suspicious messages meets the threshold. Therefore, the fifth message is infectious, as are the four previously noted and forwarded messages.

Once an already forwarded message is deemed infectious, measures are taken to prevent the infectious forwarded message from spreading (508). In the example shown above, the system will take actions to keep the 4 instances of previously forwarded message from being opened or resent by their recipients. Additionally, the system will not forward the fifth message. In some embodiments, the system reports the finding to the system administrator, the recipient, and/or other users on the network to prevent the previously forwarded infectious message from further spreading. Warning messages, log messages or other appropriate techniques may be used. In some embodiments, the system generates a cancellation request to a forwarding agent such as the mail server, which will attempt to prevent the message from being forwarded by deleting them from the send queue, moving the messages into a location to be quarantined or any other appropriate action.

Detecting and managing infectious messages have been disclosed. By performing individual message analysis and/or traffic analysis, infectious messages can be more accurately identified at time zero, and infectious messages that initially escaped detection can be later identified and prevented from further spreading.

Although the foregoing embodiments have been described in some detail for purposes of clarity of understanding, the invention is not limited to the details provided. There are many alternative ways of implementing the invention. The disclosed embodiments are illustrative and not restrictive. 

What is claimed is:
 1. A method of managing messages, the method comprising: receiving a first message over a network at a network interface, the first message including an attachment file having a file name and an embedded bit pattern; executing instructions stored in memory, wherein execution of the instructions by a processor: determines that the attachment file is executable based on the embedded bit pattern, determines that the attachment file is a text file based on the file name, stores a copy of the first message in memory based on the disparity between the determination that the attachment file is executable and the determination that the attachment file is a text file, and transmits the first message over the network to a mail server; receiving a second message over the network at the network interface; and executing instructions stored in memory, wherein execution of the instructions by a processor: compares the second message to the copy of the transmitted first message stored in memory, and deletes the second message from a local send queue and sends a cancellation request concerning the transmitted first message to the mail server, the deletion and cancellation request occurring automatically when the second message matches the copy of the transmitted first message in memory.
 2. The method of claim 1, wherein further execution of the instructions reports the match to a system administrator.
 3. The method of claim 1, wherein further execution of the instructions reports the match to a recipient of the first message.
 4. The method of claim 1, wherein further execution of the instructions reports the match to a designated recipient of the second message.
 5. The method of claim 1, wherein further execution of the instructions quarantines the second message.
 6. The method of claim 1, wherein the file name includes a .txt extension.
 7. The method of claim 1, wherein the file name includes a .doc extension.
 8. An electronic message management system, comprising: a network interface that: receives a first message over a network, the first message including an attachment file having a file name and an embedded bit pattern, transmits the first message over the network to a mail server, and receives a second message over the network at the network interface after transmitting the first message to the mail server; a memory that stores instructions; and a processor communicatively coupled to the memory and the network interface, wherein execution of the instructions stored in the memory by the processor: determines that the attachment file of the first message is executable based on the embedded bit pattern, determines that the attachment file of the first message is a text file based on the file name, stores a copy of the first message in memory based on the disparity between the determination that the attachment file is executable and the determination that the attachment file is a text file, compares the second message received after transmission of the first message to the copy of the transmitted first message stored in memory, and deletes the second message from a local send queue and sends a cancellation request concerning the transmitted first message to the mail server, the deletion and cancellation request occurring automatically when the second message matches the copy of the transmitted first message in memory.
 9. The system of claim 8, wherein further execution of the instructions reports the match to a system administrator.
 10. The system of claim 8, wherein further execution of the instructions reports the match to a recipient of the first message.
 11. The system of claim 8, wherein further execution of the instructions reports the match to a designated recipient of the second message.
 12. The system of claim 8, wherein further execution of the instructions quarantines the second message.
 13. The system of claim 8, wherein the file name includes a .txt extension.
 14. The system of claim 8, wherein the file name includes a .doc extension.
 15. A non-transitory computer readable storage medium, the medium having a computer program embodied thereon, the program executable by a processor to perform a method of managing messages, the method comprising: analyzing a first message received over a network at a network interface, the first message including an attachment file having a file name and an embedded bit pattern, wherein analyzing the first message includes: determining that the attachment file is executable based on the embedded bit pattern, and determining that the attachment file is a text file based on the file name; storing a copy of the first message in memory based on the disparity between the determination that the attachment file is executable and the determination that the attachment file is a text file; transmitting the first message over the network to a mail server; comparing a second message received over the network at the network interface to the copy of the transmitted first message stored in memory; and deleting the second message from a local send queue and sends a cancellation request concerning the transmitted first message to the mail server, the deletion and cancellation request occurring automatically when the second message matches the copy of the transmitted first message in memory.
 16. The non-transitory computer readable storage medium of claim 15, wherein further execution of the instructions reports the match to a system administrator.
 17. The non-transitory computer readable storage medium of claim 15, wherein further execution of the instructions reports the match to a recipient of the first message.
 18. The non-transitory computer readable storage medium of claim 15, wherein further execution of the instructions reports the match to a designated recipient of the second message.
 19. The non-transitory computer readable storage medium of claim 15, wherein further execution of the instructions quarantines the second message.
 20. The non-transitory computer readable storage medium of claim 15, wherein the file name includes either a .txt or .doc extension. 